Expressive completeness through logically tractable models
نویسندگان
چکیده
منابع مشابه
Expressive completeness through logically tractable models
How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the ...
متن کاملExpressive Completeness of Duration Calculus
This paper compares the expressive power of first-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of the Propositional version of Duration Calculus (PDC), a formalism for the specification of realtime systems. Our results show that the propositional duration calculus is expressively complete for first-order monadic logic of or...
متن کاملExpressive Recommender Systems through Normalized Nonnegative Models
We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ideally satisfy: high predictive power, computational tractability, and expressi...
متن کاملOn the Expressive Completeness of Underspecified Representations
One property of underspecified representation formalisms is that of expressive completeness, i.e. the ability to provide representations for all possibly occuring sets of readings. In this paper a general and formal definition of completeness along the lines of [6] will be given. Several formalisms will then be compared concerning their expressive power and shown to be incomplete.
متن کاملExpressive Completeness ofDuration and Mean Value Calculi
This paper compares the expressive power of rst-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of two formalisms for the speciication of real-time systems, the propositional versions of duration and mean value calculi. Our results show that the propositional mean value calculus is expressively complete for monadic rst-order l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2013
ISSN: 0168-0072
DOI: 10.1016/j.apal.2013.06.017